| Definitions |  es.P(es), State(ds), left + right, Top, weakSendDoApplyR{$a:ut2, $tg:ut2}(T; t; l; ds; f),   x. t(x), x.A(x),  , Id, "$x", P   Q,  x:A. B(x), Consistent(R;es), ES, R-Feasible(R), es realizer ind, s = t, Normal(ds), x dom(f). v=f(x) P(x;v),  b, x:A  B(x), a:A fp B(a), IdLnk, x:A  B(x), Type, t T, weak-send-do-apply(es;T;l;tg;a;ds;f), s ~ t, {i..j }, #$n, Outcome, *1*, x dom(f), f(x), False, IdDeq, kind(e), x,y. t(x;y), first(e),  x:A.B(x), Void, es-realizer(p),  x:A. B(x), weak-precond-send-realizable2, weak-precond-send-p(es;T;A;l;tg;a;ds;P;f),  , A  B, i j < k, a < b, ||as||, FinProbSpace, EqDecider(T), EOrderAxioms(E; pred?; info), type List, Msg(M),  , val-axiom(E;V;M;info;pred?;init;Trans;Choose;Send;val;time), r s, e < e', P & Q, Knd, kindcase(k; a.f(a); l,t.g(l;t) ), constant_function(f;A;B),  A, <a, b>, loc(e), SWellFounded(R(x;y)), pred!(e;e'),  , EState(T), weakPrecondSendR2{$a:ut2, $tg:ut2}(T; t; p; l; ds; P; f), suptype(S; T), S  T, f(x)?z, can-apply(f;x), do-apply(f;x), True, case b of inl(x) => s(x) | inr(y) => t(y), f(a), tt, ff, Unit,  , {x:A| B(x)} , if b then t else f fi |